Magic labellings of infinite graphs over infinite groups

نویسندگان

  • Diana Combe
  • Adrian M. Nelson
چکیده

A total labelling of a graph over an abelian group is a bijection from the set of vertices and edges onto the set of group elements. A labelling can be used to define a weight for each edge and for each vertex of finite degree. A labelling is edge-magic if all the edges have the same weight and vertex-magic if all the vertices are finite degree and have the same weight. We exhibit magic labellings for various countable graphs. For countably infinite stars, countable galaxies and forests, and for an arbitrary abelian group, we determine when there is an edge-magic labelling and what group elements occur as constants. In the particular case where the group is the integers, we determine when there is an vertex-magic labelling, and which integers occur as constants. We also give explicit edge-magic labellings of various frieze graphs over the integers. AMS subject classification: 05C78

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magic labellings of infinite graphs

There are many results on edge-magic, and vertex-magic, labellings of finite graphs. Here we consider magic labellings of countably infinite graphs over abelian groups. We also give an example of a finite connected graph that is edge-magic over one, but not over all, abelian groups of the appropriate order.

متن کامل

Edge-Magic Group Labellings of Countable Graphs

We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers Z, there is such a labelling whenever the graph has an infinite set of disjoint edges. A graph without an infinite set of disjoint edges must be some subgraph of H + I, where H is some finite graph and I is a countable...

متن کامل

Small Cancellation Labellings of Some Infinite Graphs and Applications

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of groups with exotic properties: • We construct the first examples of finitely generated coarsely nonamenable groups (that is, groups without Guoliang Yu’s Pro...

متن کامل

All regular graphs of small odd order are vertex-magic

This paper deals with vertex-magic total labellings of graphs. Earlier work by many authors has shown many infinite families of graphs to admit such labelings. The fact that many of these graphs are regular led MacDougall to conjecture that all non-trivial regular graphs are vertexmagic. Previously Gray and MacDougall showed that all odd-order rregular graphs (r ≥ 2) of order up to v = 19 are v...

متن کامل

A new infinite family of graceful generalised Petersen graphs, via graceful collages again

By strengthening an edge-decomposition technique for gracefully labelling a generalised Petersen graph, we provide graceful labellings for a new infinite family of such graphs. The method seems flexible enough to provide graceful labellings for many other classes of graphs in the future.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2006